Equivalence Checking of Quantum Circuits With the ZX-Calculus

As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equivalence checking circuits is an important, yet hardly automated, task in development software stack. Recently, new have been proposed that tackle this problem from widely different perspectives. One them based on ZX-calculus, a graphical rewriting system computing. However, power capability equivalence method has barely explored. The aim work evaluate ZX-calculus as tool circuits. To end, it demonstrated how approach can be expanded order verify results compilation flows optimizations It also shown not complete—especially with ancillary qubits. In properly method, we conduct detailed case study by comparing two other checking: one path-sums another decision diagrams. integrated into publicly available QCEC ( https://github.com/cda-tum/qcec ) which part Munich Quantum Toolkit (MQT).